The class reconstruction number of maximal planar graphs
نویسندگان
چکیده
منابع مشابه
The reconstruction of maximal planar graphs II. Reconstruction
We assume that the reader is familiar with the work [ 1 ] and with the notation and results of the first paper [3 1. Further terminology used in this paper will be defined as it appears. In the first paper the recognition of maximal planar graphs was established. We now prove further that this class of graphs is indeed reconstructible. We first recall that the following result was proved by Fio...
متن کاملOn the Number of Upward Planar Orientations of Maximal Planar Graphs
We consider the problem of determining the maximum and the minimum number of upward planar orientations a maximal planar graph can have. We show that n-vertex maximal planar graphs have at least Ω(n · 1.189) and at most O(n · 4) upward planar orientations. Moreover, there exist n-vertex maximal planar graphs having as few as O(n · 2) upward planar orientations and n-vertex maximal planar graphs...
متن کاملRandom planar graphs and the number of planar graphs
We survey recent progress on the enumeration of labelled planar graph and on the distribution of several parameters in random planar graphs. The main goal is to show how to use generating functions to obtain asymptotic estimates and limit probability laws. The emphasis is on presenting the main ideas while keeping technical details to a minimum.
متن کاملThe number of conformally equivalent maximal graphs
We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2 for graphs with n + 1 singularities. We also give an explicit description of the family of entire maximal graphs with a finite number of singularities all of them lying on a plane orthogonal to the ...
متن کاملSpanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 1987
ISSN: 0911-0119,1435-5914
DOI: 10.1007/bf01788528